Group testing in heterogeneous populations by using halving algorithms
نویسندگان
چکیده
منابع مشابه
Noisy Adaptive Group Testing: Bounds and Algorithms
The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the...
متن کاملHeterogeneous Learning Using Genetic Algorithms
The goal of this chapter is twofold. First, assuming that all agents belong to a genetic population, the evolution of inflation learning will be studied using a heterogeneous genetic learning process. Second, by using real-floating-point coding and different genetic operators, the quality of the learning tools and their possible impact on the learning process will be examined.
متن کاملEfficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
In the k-junta testing problem, a tester has to efficiently decide whether a given function f : {0, 1} → {0, 1} is a kjunta (i.e., depends on at most k of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ( √ k/ε) and time complexity Õ(n √ k/ε). This quadratically improves over the query complexity of the previous best q...
متن کاملA Stabilization Group Approach for Heterogeneous Populations of Trauma Clients
High prevalence and long-lasting implications of human-inflicted trauma call for effective treatment approaches reaching clients in need of trauma-specific treatment. Numerous approaches exist, but often with limited empirical support. There is also a tendency toward segregating treatment approaches depending on type of exposure history and presenting symptoms. This might exclude clients in nee...
متن کاملGenome Halving by Block Interchange
We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Royal Statistical Society: Series C (Applied Statistics)
سال: 2011
ISSN: 0035-9254
DOI: 10.1111/j.1467-9876.2011.01008.x